Approximation of Partial Capacitated Vertex Cover

Approximation of Partial Capacitated Vertex Cover

We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graphG and a covering requirement L. Each edge e in G is associated with a demand (or load) l(e), and each vertex v is associated with a (soft) capacity c(v) and a weight w(v). A feasible solution is an assignment of edges to vertices such that the total demand of assigned edges is at least L. The weig...

Improved Approximation Algorithms for the Partial Vertex Cover Problem

Replica Placement via Capacitated Vertex Cover

In this paper, we study the replica placement problem on trees and present a constant factor approximation algorithm (with an additional additive constant factor). This improves the best known previous algorithm having an approximation ratio dependent on the maximum degree of the tree. Our techniques also extend to the partial cover version. Our algorithms are based on the LP rounding technique...

On approximation of max-vertex-cover

A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover

In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an efficient, deterministic, distributed approximation algorithm for the problem. Our algorithm computes a (2 + ǫ)-approximate solution which violates the capacity constraints by a factor of (4 + ǫ) in a polylogarithmic num...